Combinatorial Game Theory Workshop

نویسنده

  • E. Berlekamp
چکیده

A main aim of the workshop was to bring together the two camps, mathematicians working in combinatorial game theory and computer scientists interested in algorithmics and Artificial intelligence. The Workshop attracted a mix of people from both communities (17 from mathematics, 16 from computer science and 2 undergraduates) as well as a mixture of new and established researchers. The oldest was Richard Guy, turning 90 in 2006 and the youngest was in 3rd year University. There were attendees from Europe, Asia as well as North America. The Workshop succeeded in its primary goal and more. New collaborations were struck. There was quick dissemination and evaluation of major new results and new results were developed during the Workshop. Part of the success was due to the staff and facilities at BIRS. The facilities at BIRS were appreciated by all the participants. The main room allowed lectures to mix computer presentations with overheads and chalkboard calculations. (No prizes for guessing which community used which technology.) The coffee lounges and break away rooms allowed discussions to continue on, in comfort, until late in the night. Our thanks go to all the staff who made the stay such a wonderful experience and to the BIRS organization for hosting the workshop.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Games Workshop 11w5073

Combinatorial game theory deals principally with two person games of perfect information and without chance elements. It provides techniques for determining who can win from a game position and how. While ad hoc techniques for such analysis are as old as humanity, the modern theory employs more powerful and general tools such as the notion of a game-theoretic value. From a mathematical standpoi...

متن کامل

Conditional combinatorial games and their application to analyzing capturing races in Go

Conditional combinatorial games (CCG) are a new tool developed for describing loosely coupled games. The definition of CCG is based on the one for classical independent combinatorial games. However, play in a CCG depends on its global context: certain moves are legal only if a nonlocal context condition is currently true. Compared with independent combinatorial games, CCG only allow some weaker...

متن کامل

Management of Uncertainty in Combinatorial Game Theory

We describe a method to handle uncertainty in combinatorial game theory. This method has been implemented in Gogol, a general game playing system mainly applied to the game of Go. In complex games such as Go, a search intensive approach is intractable. Gogol uses a lot of knowledge and little search. This knowledge is represented using combinatorial game theory. We have adapted this theory to t...

متن کامل

Amazons, Konane, and Cross Purposes are PSPACE-complete

Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [3] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. Konane is an ancient Hawaiian game, with moves similar to peg solitaire. Kona...

متن کامل

Computational Voting Theory: Game-Theoretic and Combinatorial Aspects

Computer Science) Computational Voting Theory: Game-Theoretic and Combinatorial Aspects

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005